Modular Compilers Based on Monad

The monadic style of language speciication has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to reeect modiications in the source language. It has proven dif-cult to extend the method to compilation. We demonstrate that by introducing machine-like stores (code and data) into the monadic semantics and then partially evaluating the resulting semantic expressions, we can achieve many of the same advantages for a compiler as for an interpreter. A number of language constructs and features are compiled: expressions, CBV and CBN evaluation of-expressions, dynamic scop-ing, and various imperative features. The treatment of recursive procedures is outlined as well. The resulting method allows compilers to be constructed in a mix-and-match fashion just as in a monad-structured interpreter.